翻訳と辞書 Words near each other ・ Mats Qviberg ・ Mats Rits ・ Mats Ronander ・ Mats Rondin ・ Mats Rosseli Olsen ・ Mats Rubarth ・ Mats Rudal ・ Mats Rådberg ・ Mats Scheidegger ・ Mats Seuntjens ・ Mats Solheim ・ Mats Strandberg ・ Matroid ・ Matroid embedding ・ Matroid girth ・ Matroid intersection ・ Matroid minor ・ Matroid oracle ・ Matroid partitioning ・ Matroid polytope ・ Matroid rank ・ Matroid representation ・ Matron ・ Matron Head ・ Matron literature ・ Matron Stakes ・ Matron Stakes (Ireland) ・ Matron Stakes (United States) ・ Matron's badge ・ Matrona Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Matroid intersection ： ウィキペディア英語版 Matroid intersection In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are assigned real weights, the weighted matroid intersection problem is to find a common independent set with the maximum possible weight. These problems generalize many problems in combinatorial optimization including finding maximum matchings and maximum weight matchings in bipartite graphs and finding arborescences in directed graphs. The matroid intersection theorem, due to Jack Edmonds, says that there is always a simple upper bound certificate, consisting of a partitioning of the ground set amongst the two matroids, whose value (sum of respective ranks) equals the size of a maximum common independent set. Based on this theorem, the matroid intersection problem for two matroids can be solved in polynomial time using matroid partitioning algorithms. ==Example== Let ''G'' = (''U'',''V'',''E'') be a bipartite graph. One may define a partition matroid ''MU'' on the ground set ''E'', in which a set of edges is independent if no two of the edges have the same endpoint in ''U''. Similarly one may define a matroid ''MV'' in which a set of edges is independent if no two of the edges have the same endpoint in ''V''. Any set of edges that is independent in both ''MU'' and ''MV'' has the property that no two of its edges share an endpoint; that is, it is a matching. Thus, the largest common independent set of ''MU'' and ''MV'' is a maximum matching in ''G''. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Matroid intersection」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.